Polarity Guided Tractable Reasoning
نویسنده
چکیده
Non-clausal refinement of Boolean Constraint Propagation inference procedure for classical logic, called P-BCP, is introduced within a new knowledge representational formalism of polarized formulas. P-BCP is a sound, incomplete, and linear-time inference procedure. It is shown that P-BCP can be adopted for tractable reasoning in a number of non-classical logics (including some modal and finitely-valued logics).
منابع مشابه
A Computational Model of Tractable Reasoning
Polynomial time complexity is the usuaìthreshold' for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in the context of knowledge representation and reasoning. It is argued that doing so may be inappropriate in the context of common sense reasoning underlying language understanding. A more stringent criteria of tractability is pr...
متن کاملReasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic
Automated reasoning about sets has received a considerable amount of interest in the literature. Techniques for such reasoning have been used in, for instance, analyses of programming languages, terminological logics and spatial reasoning. In this paper, we identify a new class of set constraints where checking satissability is tractable (i.e. polynomial-time). We show how to use this tractabil...
متن کاملCell Polarity: Netrin Calms an Excitable System
In a tractable model for cell invasion, the Caenorhabditis elegans anchor cell migrates through basement membranes towards a polarity cue provided by netrin. A new study reveals that the anchor cell polarity network can break symmetry and oscillate in the absence of netrin, suggesting the presence of interlinked positive and negative feedback loops, which are common in polarity pathways.
متن کاملQualitative Spatial and Temporal Reasoning: Efficient Algorithms for Everyone
In the past years a lot of research effort has been put into finding tractable subsets of spatial and temporal calculi. It has been shown empirically that large tractable subsets of these calculi not only provide efficient algorithms for reasoning problems that can be expressedwith relations contained in the tractable subsets, but also surprisingly efficient solutions to the general, NP-hard re...
متن کاملExploring Parallel Tractability of Ontology Materialization
Materialization is an important reasoning service for applications built on theWeb Ontology Language (OWL). To make materialization efficient in practice, current research focuses on deciding tractability of an ontology language and designing parallel reasoning algorithms. However, some well-known large-scale ontologies, such as YAGO, have been shown to have good performance for parallel reason...
متن کامل